计算机与现代化 ›› 2009, Vol. 1 ›› Issue (7): 70-74.doi: 10.3969/j.issn.1006-2475.2009.07.020
• 网络与通信 • 上一篇 下一篇
迟文杰，陈家琪
收稿日期:
修回日期:
出版日期:
发布日期:
CHI Wen-jie, CHEN Jia-qi
Received:
Revised:
Online:
Published:
摘要： 高速多媒体网络中的路由问题是有QoS约束的路由问题，多受限的路由问题是一个NP完全问题。本文提出了一种解决多受限QoS路由问题的改进微粒群算法。该算法利用记忆库来动态调整惯性权重值，加快了算法的收敛速度。同时结合进化、灾变机制避免了算法陷入局部极值的问题。在列出改进算法的具体步骤基础上，通过实例证明了算法的有效性，使多受限QoS路由优化问题很好地得到了解决。
关键词: 多受限, QoS路由, 改进微粒群算法
Abstract: In multimedia network, the routing problem is subject to QoS constrains. These problems are NPcomplete. An improved particle swarm algorithm is proposed to solve the QoS routing for multiple constrains. Some methods of evolution mechanism, constructing feasible solution space and adaptive inertia weight are presented to enhance capability of algorithm searching the best global solution. Simulation results verify the proposed algorithm is effective. The algorithm gets good performance and can effectively solve QoS routing with multiple constrains.
Key words: multiple constrains, QoS routing, improved particle swarm algorithm
中图分类号:
TP273
迟文杰;陈家琪. 应用改进微粒群算法求解QoS路由技术问题[J]. 计算机与现代化, 2009, 1(7): 70-74.
CHI Wen-jie;CHEN Jia-qi. Solving Multiple Constrains QoS Routing Based on Improved Particle Swarm Algorithm[J]. Computer and Modernization, 2009, 1(7): 70-74.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.c-a-m.org.cn/CN/10.3969/j.issn.1006-2475.2009.07.020
http://www.c-a-m.org.cn/CN/Y2009/V1/I7/70
